Embeddings of complete binary trees into star graphs with congestion 1
نویسندگان
چکیده
In this paper, we giae a conslruc2io1~ of embeddings of vertex-congestion 1 and dilaiiou 4 of complete binary trees into star graph,s. The heighl of the trees embedded into th.e n-dimeasloaal star graph S, is(7?+1)~log~nJ-2 L’Ogz nJ+l + 1, which tmprorcs th.e previous result from. [5],[6] by more thnzt n/2 1. Il’e then consiruct em.beddings of zjerter-coagestion 1. dilation at mosi an + 2, of complete bzuary trees tato ihe n-dim.ensional star graph, wh.osf heighi differs from the theoretical upper bound of log, n! by less then
منابع مشابه
Embedding Complete Binary Trees into Star Networks
Abs t rac t . Star networks have been proposed as a possible interconnection network for massively parallel computers. In this paper we investigate embeddings of complete binary trees into star networks. Let G and H be two networks represented by simple undirected graphs. An embedding of G into H is an injective mapping f from the vertices of G into the vertices of H. The dilation of the embedd...
متن کاملCongestion-free, dilation-2 embedding of complete binary trees into star graphs
Trees are a common structure to represent the inter-task communication pattern of a parallel algorithm. In this paper, we consider the embedding a complete binary tree in a star graph with the objective of minimizing congestion and dilation. We develop two embeddings: i) a congestion-free, dilation-2, load-1 embedding of a level-p binary tree, and ii) a congestion-free, dilation-2, load-2 k emb...
متن کاملEmbedding of Congestion-free Complete Binary Trees with Dilation Two in Star Graphs
Trees are a common structure to represent the inter-task communication pattern of a parallel algorithm. In this paper, we consider the problem of embedding a complete binary tree in a star graph with the objective of minimizing congestion and dilation. We develop a congestion-free, dilation-2, load-1 embedding of a level-p binary tree into an n-dimensional star graph, where p = n i=2 blog ic an...
متن کاملEmbedding of Hypercubes into Complete Binary Trees
We estimate and characterize the edge congestion-sum measure for embeddings of hypercubes into complete binary trees. Our algorithms produce optimal values of sum of edge-congestions in linear time.
متن کاملEmbeddings of Complete Binary Trees into Grids and Extended Grids with Total Vertex-congestion 1
Abstract Let G and H be two simple undirected graphs An embedding of the graph G into the graph H is an injective mapping f from the vertices of G to the vertices of H together with a mapping which assigns to each edge u v of G a path between f u and f v in H The grid M r s is the graph whose vertex set is the set of pairs on nonnegative integers f i j i r j sg in which there is an edge between...
متن کامل